Search results for "BERNSTEIN POLYNOMIALS"
showing 5 items of 5 documents
A semi-parametric stochastic generator for bivariate extreme events
2017
The analysis of multiple extreme values aims to describe the stochastic behaviour of observations in the joint upper tail of a distribution function. For instance, being able to simulate multivariate extreme events is convenient for end users who need a large number of random replications of extremes as input of a given complex system to test its sensitivity. The simulation of multivariate extremes is often based on the assumption that the dependence structure, the so-called extremal dependence function, is described by a specific parametric model. We propose a simulation method for sampling bivariate extremes, under the assumption that the extremal dependence function is semiparametric. Th…
Bayesian inference for the extremal dependence
2016
A simple approach for modeling multivariate extremes is to consider the vector of component-wise maxima and their max-stable distributions. The extremal dependence can be inferred by estimating the angular measure or, alternatively, the Pickands dependence function. We propose a nonparametric Bayesian model that allows, in the bivariate case, the simultaneous estimation of both functional representations through the use of polynomials in the Bernstein form. The constraints required to provide a valid extremal dependence are addressed in a straightforward manner, by placing a prior on the coefficients of the Bernstein polynomials which gives probability one to the set of valid functions. The…
Multivariate nonparametric estimation of the Pickands dependence function using Bernstein polynomials
2017
Abstract Many applications in risk analysis require the estimation of the dependence among multivariate maxima, especially in environmental sciences. Such dependence can be described by the Pickands dependence function of the underlying extreme-value copula. Here, a nonparametric estimator is constructed as the sample equivalent of a multivariate extension of the madogram. Shape constraints on the family of Pickands dependence functions are taken into account by means of a representation in terms of Bernstein polynomials. The large-sample theory of the estimator is developed and its finite-sample performance is evaluated with a simulation study. The approach is illustrated with a dataset of…
OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS
2010
The tensorial Bernstein basis for multivariate polynomials in n variables has a number 3n of functions for degree 2. Consequently, computing the representation of a multivariate polynomial in the tensorial Bernstein basis is an exponential time algorithm, which makes tensorial Bernstein-based solvers impractical for systems with more than n = 6 or 7 variables. This article describes a polytope (Bernstein polytope) with a number of faces, which allows to bound a sparse, multivariate polynomial expressed in the canonical basis by solving several linear programming problems. We compare the performance of a subdivision solver using domain reductions by linear programming with a solver using a c…
On the Complexity of the Bernstein Combinatorial Problem
2012
International audience